Bipartite Rigidity
نویسنده
چکیده
We develop a bipartite rigidity theory for bipartite graphs parallel to the classical rigidity theory for general graphs, and define for two positive integers k, l the notions of (k, l)-rigid and (k, l)-stress free bipartite graphs. This theory coincides with the study of Babson–Novik’s balanced shifting restricted to graphs. We establish bipartite analogs of the cone, contraction, deletion, and gluing lemmas, and apply these results to derive a bipartite analog of the rigidity criterion for planar graphs. Our result asserts that for a planar bipartite graph G its balanced shifting, G, does not contain K3,3; equivalently, planar bipartite graphs are generically (2, 2)-stress free. We also discuss potential applications of this theory to Jockusch’s cubical lower bound conjecture and to upper bound conjectures for embedded simplicial complexes.
منابع مشابه
Rigidity of Graph Joins and Hendrickson's Conjecture
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete bipartite graphs. We use this characterization to identify new families of counterexamples, including infinite families, in R and above to Hendrickson’s conjecture on...
متن کاملThe Rigidity of New Classes of Graphs
We examine the generic local and global rigidity of various graphs in R. We analyze two classes of graphs that satisfy Hendrickson’s conditions for generic global rigidity, yet fail to be generically globally rigid. We find a large family of bipartite graphs with d > 3, and we use a method that generates infinitely many graphs in R. Finally, we state some conjectures for further exploration.
متن کاملOn The Structure of Barrier Graphs
Wireless sensor networks are commonly used to monitor various environmental conditions. Possible geometries for the region covered by a sensor include disks, wedges, and rays, among others, depending on the function of the sensor. In this paper we consider a network consisting of ray sensors deployed to detect intruders traversing a path, not necessarily straight, from a source α to a destinati...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملUsing Weighted Bipartite Matching to Solve the General 3-D Rigid Motion Problem
This paper presents a solution to recovering the rigid transformation (rotation and translation) that brings two 3-D point sets into alignment, when the correspondences between the points are not known and there exist missing data. This is called the general 3-D rigid body motion problem (also known as absolute orientation problem). For ideal cases with no missing points, a closed-form solution...
متن کامل